New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities
نویسندگان
چکیده
The Grishukhin inequality is a facet of the cut polytope CUT7 of the complete graph K7, for which no natural generalization to a family of inequalities has previously been found. On the other hand, the Imm22 Bell inequalities of quantum information theory, found by Collins and Gisin, can be seen as valid inequalities of the cut polytope CUT¤(K1,m,m) of the complete tripartite graph K1,m,m. They conjectured that they are facet inducing. We prove their conjecture by relating the Imm22 inequalities to a new class of facets of CUTN that are a natural generalization of the Grishukhin inequality. An important component of the proof is the use of a method called triangular elimination, introducted by Avis, Imai, Ito and Sasaki, for producing facets of CUT¤(K1,m,m) from facets of CUTN .
منابع مشابه
Deriving Tight Bell Inequalities for 2 Parties with Many 2-valued Observables from Facets of Cut Polytopes
Relatively few families of Bell inequalities have previously been identified. Some examples are the trivial, CHSH, Imm22, and CGLMP inequalities. This paper presents a large number of new families of tight Bell inequalities for the case of many observables. For example, 44,368,793 inequivalent tight Bell inequalities other than CHSH are obtained for the case of 2 parties each with 10 2-valued o...
متن کاملGenerating facets for the cut polytope of a graph by triangular elimination
The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of the facets of the cut polytope of the complete bipartite graph or, more generally, the complete k-partite graph. Lifting is a central tool to ...
متن کاملTwo-party Bell inequalities derived from combinatorics via triangular elimination
Abstract. Bell inequalities, originally introduced as a method to prove that some quantum states show nonlocal behavior, are now studied as a method to capture the extent of the nonlocality of quantum states. Tight Bell inequalities are considered to be more important than redundant ones. Despite the increasing importance of the study of Bell inequalities, few kinds of tight Bell inequalities h...
متن کاملFacets for the cut cone II: Clique-web inequalities
We study new classes of facets for the cut cone C, generated by the cuts of the complete graph on n vertices. This cone can also be interpreted as the cone of all semi-metrics on n points that are isometrically l~-embeddable and, in fact, the study of the facets of the cut polytope is in some sense equivalent to the study of the facets of C~. These new facets belong to the class of clique-web i...
متن کاملNew facets of the STS polytope generated from known facets of the ATS polytope
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on an incomplete graph with 2n vertices, no method was available until recently for using this correspondence to derive facets of the symmetric traveling salesman polytope from facets of the asymmetric one. In this paper w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 155 شماره
صفحات -
تاریخ انتشار 2007